Barabási-Albert Çizgesinde K-Derece Anonimleştirmenin Performans Analizi

Anonymity is one the most important problems that emerged with increasing number of graph-based social networks. It not straightforward to ensure anonymity by adding or removing some nodes from graph. Therefore, a more sophisticated approach required. The consideration degree in graph may facilitate having knowledge about specific nodes. To handle this problem, prominent solutions k-degree anonymization where involving particular values are anonymized masking its information attackers. Our objective evaluate achievement well-known structure, namely, Barabási-Albert graph, which similar graphs on Hence, we generate multiple synthetic and performance these graphs. According experimental results, success approximately proportional edges